The restrictive H-coloring problem

We define a variant of the H-coloring problem where the number of preimages of certain vertices is predetermined as part of the problem input. We consider the decision and the counting version of the problem, namely the restrictive H-coloring and the restrictive #H-coloring problems, and we provide a dichotomy theorem determining the H’s for which the restrictive H-coloring problem is either NP-complete or polynomial time solvable. Moreover, we prove that the same criterion discriminates the #P-complete and the polynomially solvable cases of the restrictive #H-coloring problem. Finally, we show that both our results apply also for the list versions and other extensions of the problems.